Graphs on Affine and Linear Spaces and Deuber Sets
نویسندگان
چکیده
منابع مشابه
Graphs on Affine and Linear Spaces and Deuber Sets
If G is a large Kk-free graph, by Ramsey’s theorem, a large set of vertices is independent. For graphs whose vertices are positive integers, much recent work has been done to identify what arithmetic structure is possible in an independent set. This paper addresses similar problems: for graphs whose vertices are affine or linear spaces over a finite field, and when the vertices of the graph are...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولFlat graphs based on affine spaces and affine symplectic spaces
Let AG(n,Fq) be the n-dimensional affine space over the finite field Fq. For 0 ≤ m ≤ n − 1, define a graph G whose vertex set is the set of all m-flats of AG(n,Fq), such that two vertices F1 and F2 are adjacent if dim(F1∨F2) = m+1, where F1∨F2 is the minimum flat containing both F1 and F2. Let ASG(2ν,Fq) be the 2ν-dimensional affine-symplectic space over Fq. Define a graph S (ν) whose vertex se...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولIndependent Deuber sets in graphs on the natural numbers
We show that for any k,m, p, c, if G is a Kk-free graph on N then there is an independent set of vertices in G that contains an (m, p, c)-set. Hence if G is a Kk-free graph on N, then one can solve any partition regular system of equations in an independent set. This is a common generalization of partition regularity theorems of Rado (who characterized systems of linear equations Ax = 0 a solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/2732